A heuristic procedure for solving the Lexicographic Bottleneck Assembly Line Balancing Problem (LB-ALBP)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem

The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem —recently introduced to the literature (...

متن کامل

genetic algorithms for assembly line balancing problem

there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...

متن کامل

Meta-heuristic Approaches for the Assembly Line Balancing Problem

Assembly line balancing problem (ALBP) is a decision problem arising when designing or redesigning an assembly line and it consists in finding the optimal assignment of tasks among the workstations corresponding to some objectives. This paper deals with the single-model ALBP with the aim of minimizing the cycle time and maximizing the workload smoothness among the workstations. In order to solv...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Solving a multi-objective mixed-model assembly line balancing and sequencing problem

This research addresses the mixed-model assembly line (MMAL) by considering various constraints. In MMALs, several types of products which their similarity is so high are made on an assembly line. As a consequence, it is possible to assemble and make several types of products simultaneously without spending any additional time. The proposed multi-objective model considers the balancing and sequ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Production Research

سال: 2012

ISSN: 0020-7543,1366-588X

DOI: 10.1080/00207543.2011.578164